User Scheduling Algorithm for Cell Capacity Maximization in Full Duplexing Wireless Cellular Networks
نویسندگان
چکیده
منابع مشابه
Optimal Scheduling Algorithm for Throughput Maximization in Multihop Wireless Networks
In this paper, focus on designing a scheduling scheme for achieve maximum throughput. Although, it does not require per-flow or perdestination information and also, this paper consider the problem of link scheduling in Multihop Wireless Networks under general interference constraints. The main goal is to achieve maximum throughput and better delay performance at low complexity. Previously, we u...
متن کاملAdaptive QoS scheduling in wireless cellular networks
Quality of service (QoS) has been always controversial in resource shared networks. Scheduling as a packet prioritizing mechanism at Data Link Layer (DLL) contributes to QoS guarantee provisioning significantly. In this paper, a novel packet scheduler is developed in wireless cellular networks. The proposed scheme provides QoS-guaranteed service for the applications running on the sensor nodes ...
متن کاملRobust Packet Scheduling in Wireless Cellular Networks
This paper addresses the following scheduling problem in wireless packet switched networks: Given that only coarse-grained channel state information is available, how to design a robust scheduler that ensures worst-case optimal performance? To solve this problem, we take a zero-sum game theoretic approach, in which the scheduler and the channel error act as non-cooperative adversaries in the sc...
متن کاملUtility Maximization Scheduling in Multi-channel Wireless Networks
This paper considers the problem of designing utility maximization scheduling algorithms for multi-channel(e.g, OFDM-based) wireless down-link systems. We extend Lyapunov Optimization to design a throughput-utility maximizing algorithm that uses a queue-based and delay-based Lyapunov functions, where the delay uses explicit delay information from the head-of-line packet destined to each user. O...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Institute of Information and Communication Engineering
سال: 2014
ISSN: 2234-4772
DOI: 10.6109/jkiice.2014.18.11.2613